The Spectral Gap of a Random Subgraph of a Graph
نویسندگان
چکیده
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (in terms of its normalized Laplacian) and minimum degree dmin. Then we can show that a random subgraph of G on n vertices with edge-selection probability p almost surely has as its spectral gap λ−O (√ logn pdmin + (logn) 3/2 pdmin(log logn) 3/2 ) .
منابع مشابه
The principal ideal subgraph of the annihilating-ideal graph of commutative rings
Let $R$ be a commutative ring with identity and $mathbb{A}(R)$ be the set of ideals of $R$ with non-zero annihilators. In this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_P(R)$. It is a (undirected) graph with vertices $mathbb{A}_P(R)=mathbb{A}(R)cap mathbb{P}(R)setminus {(0)}$, where $mathbb{P}(R)$ is...
متن کاملA Statistical Model for Motifs Detection
We introduce a statistical model for the problem of finding a subgraph with specified topology in an otherwise random graph. This task plays an important role in the analysis of social and biological networks. In these type of networks, small subgraphs with a specific structure have important functional roles. Within our model, a single copy of a subgraph is added (‘planted’) in an Erdős-Renyi ...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملStudy on the new graph constructed by a commutative ring
Let R be a commutative ring and G(R) be a graph with vertices as proper andnon-trivial ideals of R. Two distinct vertices I and J are said to be adjacentif and only if I + J = R. In this paper we study a graph constructed froma subgraph G(R)Δ(R) of G(R) which consists of all ideals I of R such thatI Δ J(R), where J(R) denotes the Jacobson radical of R. In this paper westudy about the relation b...
متن کاملPercolation in General Graphs
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function of G) for which a giant component emerges. Suppose G satisfies some (mild) conditions depending on its spectral gap and higher moments of its degree sequence. We define the second order average degree d̃ to be d̃ = ∑ v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Internet Mathematics
دوره 4 شماره
صفحات -
تاریخ انتشار 2007